Dynamic host-group/multidestination routing for multicast sessions

نویسندگان

  • Qi He
  • Mostafa H. Ammar
چکیده

Multicast routing research efforts have mostly focused on supporting the host-group model in which multicast packets are addressed to a host (or multicast) group. Another multicast routing approach uses multi-destination addressing, where a multicast packet carries a list of the unique (unicast) addresses of all the group members. This form of routing can be accomplished using limited or no additional state beyond the existing unicast routing tables. It, therefore, scales well with the number of multicast sessions but does not scale well with the size of the multicast group and, in fact, requires the size of the multicast group to be below a certain threshold. In this paper, we envision a future scenario in which both host-group and multi-destination addressing routing approaches coexist within the Internet. We develop a dynamic routing context for this future scenario wherein a multicast session can adapt among different routing configurations depending on the number of multicast group members and how this number changes over time. We consider three routing options: 1) A single multi-destination addressed flow – suitable for small-group sessions, 2) multiple multidestination addressed flows – suitable for medium-group sessions and 3) a single host-group addressed flow – suitable for large-group sessions. For multicast sessions that vary in group membership over time, different routing protocols may be best at different points in time. Our work is concerned with the development and evaluation of protocols that allow a multicast session to dynamically switch among these three routing options as the size of the session’s group changes. Of primary concern in our design and evaluation is the tradeoff between the overhead of the protocols needed for switching among the various routing options and the savings realized by choosing the most appropriate routing protocol as a multicast session’s group size changes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidestination Message Passing in Wormhole k-ary n-cube Networks with Base Routing Conformed Paths

This paper proposes multidestination message passing on wormhole k-ary n-cube networks using a new base-routing-conformed-path (BRCP) model. This model allows both unicast (single-destination) and multidestination messages to co-exist in a given network without leading to deadlock. The model is illustrated with several common routing schemes (deterministic, as well as adaptive), and the associa...

متن کامل

Ecient path-based multicast in wormhole-routed mesh networks

The capability of multidestination wormhole allows a message to be propagated along any valid path in a wormholerouted network conforming to the underlying base routing scheme. The multicast on the path-based routing model is highly dependent on the spatial locality of destinations participating in multicasting. In this paper, we propose two proximity grouping schemes for ecient multicast in w...

متن کامل

Efficient path-based multicast in wormhole-routed mesh networks

The capability of multidestination wormhole allows a message to be propagated along any valid path in a wormholerouted network conforming to the underlying base routing scheme. The multicast on the path-based routing model is highly dependent on the spatial locality of destinations participating in multicasting. In this paper, we propose two proximity grouping schemes for ecient multicast in w...

متن کامل

Responsible Source Multicasting

There is no effective method to support IP level Internet wide multisource multicast sessions, that can be easily used from almost every ISP There are several protocols implementing the necessary functionality, but the penetration of them is really low recently. The most obvious work all-round is using SSM – Source Specific Multicasting, in which, the IP multicast session is identified by the m...

متن کامل

Multicasting on Switch-based Irregular Networks Using Multi-drop Path-based Multidestination Worms 1

This paper presents a novel concept of multi-drop path-based multidestination message passing on switch-based irregular networks. First, the multi-drop mechanism is deened with an associated header encoding scheme, and this mechanism is used to develop path-based multidestination worms. Next, a method is proposed to identify valid multidestination paths on arbitrary irregular networks with a ty...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003